New $[47,15,16]$ Linear Binary Block Code

New [48,16,16] Optimal Linear Binary Block Code

ALinear binary [n, k]-code is a k-dimensional subspaces of the n-dimensional vector space GF (2) over the finite field GF (2) with 2 elements. The 2 codewords of length n are the elements of the subspace, they are written as row vectors. The weight wt(c) of a codeword is defined to be the number of nonzero entries of c and the minimum distance dist(C) of a code C is the minimum of all weights o...

New [47, 15, 16] Linear Binary Block Code

A new [47; 15; 16] linear binary block code and its weight spectrum is presented. The code is better than the previously known [47;15;15] code and it reaches the upper bound on code distance for the codeword length 47 and dimension 15.

Binary Linear Block Codes

A new concatenated linear high rate space-time block code

Future wireless communication systems are characterized by heterogeneity in terms of node capabilities, link level requirements, propagation environments, cell designs and subnet structures. High carrier frequencies and large system bandwidth will make extreme diversity factors feasible. This imposes new requirements on space-time codes. In this paper we present a new concatenated linear space-...

Voronoi regions for binary linear block codes

The Voronoi regions of a block code govern many aspects of the code’s performance on a Gaussian channel, and they are fundamental instruments in, for example, error probability analysis and soft decision decoding. This paper presents an efficient method to find the boundaries of the Voronoi regions for an arbitrary binary linear block code. Two theoretical results together lead to the Voronoi r...